The Lollipop Graph is Determined by its Spectrum
نویسندگان
چکیده
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path with pendant vertex as distinguished vertex. It is known that the odd lollipop is determined by its spectrum and the question is asked by W. Haemers, X. Liu and Y. Zhang for the even lollipop. We revisit the proof for odd lollipop, generalize it for even lollipop and therefore answer the question. Our proof is essentially based on a method of counting closed walks. Let G be a simple graph with n vertices and A its adjacency matrix, Q G (X) denotes its characteristic polynomial and λ 1 (G) ≥ λ 2 (G) ≥ · · · ≥ λ n (G) the associated eigenvalues; λ 1 (G) is the spectral radius of G. It is known that some informations about the graph structure can be deduced from these eigenvalues such as the number of edges or the length of the shortest odd cycle; but the reverse question Which graphs are determined by their spectrum ? (asked, among others, in [4]) is far from being solved; some partial results exist [5, 10, 12] which contribute to answer this question. Let us remind that the coalescence of two graphs G 1 with distinguished vertex v 1 and G 2 with distinguished vertex v 2 , is formed by identifying vertices v 1 and v 2 that is, the vertices v 1 and v 2 are replaced by a single vertex v adjacent to the same vertices in G 1 as v 1 and the same vertices in G 2 as v 2. If it is not necessary v 1 or v 2 may not be specified. A lollipop L(p, k) is the coalescence of a cycle C p with p ≥ 3 vertices and a path P k+1 with k + 1 ≥ 2 vertices with one of its vertex of degree one as distinguished vertex, figure 1 shows an example of a lollipop. The lollipop L(p, 0) is C p. An even (resp. odd) lollipop has a cycle of even (resp. odd) length. In this paper we shall show that the lollipop graph is determined by its spectrum, answering to an open question asked in [8, 3] for even lollipop. It is known [8] that the odd lollipop is determined by its spectrum, but the 1 proof given in [8] cannot be …
منابع مشابه
Erratum to "The lollipop graph is determined by its Q-spectrum"
A graph G is said to be determined by its Q-spectrum if with respect to the signless Laplacian matrix Q , any graph having the same spectrum as G is isomorphic to G. The lollipop graph, denoted by Hn,p, is obtained by appending a cycle Cp to a pendant vertex of a path Pn−p. In this paper, it is proved that all lollipop graphs are determined by their Q -spectra. © 2008 Elsevier B.V. All rights r...
متن کاملCharacterizations of the simple group $D_{n}(3)$ by prime graph and spectrum
We prove that $D_n(3)$, where $ngeq6$ is even, is uniquely determined by its prime graph. Also, if $G$ is a finite group with the same prime graph as $D_4(3)$, then $Gcong D_4(3), B_3(3), C_3(3)$ or $G/O_2(G)cong {rm Aut}({}^2B_2(8))$.
متن کاملON NEW CLASSES OF MULTICONE GRAPHS DETERMINED BY THEIR SPECTRUMS
A multicone graph is defined to be join of a clique and a regular graph. A graph $ G $ is cospectral with graph $ H $ if their adjacency matrices have the same eigenvalues. A graph $ G $ is said to be determined by its spectrum or DS for short, if for any graph $ H $ with $ Spec(G)=Spec(H)$, we conclude that $ G $ is isomorphic to $ H $. In this paper, we present new classes of multicone graphs...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملBorderenergetic graphs of order 12
A graph G of order n is said to be borderenergetic if its energy is equal to 2n-2 and if G differs from the complete graph Kn. The first such graph was discovered in 2001, but their systematic study started only in 2015. Until now, the number of borderenergetic graphs of order n was determined for n
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008